Computing Minimal Models Modulo Subset-Simulation for Modal Logics

نویسندگان

  • Fabio Papacchini
  • Renate A. Schmidt
چکیده

In this paper we propose a novel minimality criterion for models of modal logics based on a variation of the notion of simulation, called subset-simulation. We present a minimal model sound and complete tableau calculus for the generation of this new kind of minimal models for the multi-modal logic K(m), and we discuss extensions to cover more expressive logics. The generation of minimal models is performed incrementally by using a minimality test to close branches representing non-minimal models, or to update the set of minimal models. Subset-simulation minimal models have the advantage that they are semantically more natural than models obtained by using syntactic min-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Models Modulo Subset-Simulation for Modal Logics

In this abstract we present a novel minimality criterion for models of propositional modal logics, and we sketch a tableau calculus for the generation of minimal models based on this new minimality criterion.

متن کامل

Terminating Minimal Model Generation Procedures for Propositional Modal Logics

Model generation and minimal model generation are useful for tasks such as model checking and for debugging of logical specifications. This paper presents terminating procedures for the generation of models minimal modulo subset-simulation for the modal logic K and all combinations of extensions with the axioms T, B, D, 4 and 5. Our procedures are minimal model sound and complete. Compared with...

متن کامل

Subset-Simulation as Minimality Criterion

We present a new kind of simulation with the aim of using it as minimality criterion for models of modal logics. We discuss such minimality criterion by comparing it with minimal modal Herbrand models. Even though our final goal is the automated generation of minimal models through a tableau-based method, this paper is on a theoretical level and does not aim to propose algorithms on how to gene...

متن کامل

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations

This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders over labelled transition systems. It is shown that there are mutual translations between modal transition systems and labelled transition systems t...

متن کامل

On the specification of modal systems: A comparison of three frameworks

This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders over labelled transition systems. It is shown that there are mutual translations between modal transition systems and labelled transition systems t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013